SSDLP: Sharing Secret Data between Leader and Participant
نویسندگان
چکیده
منابع مشابه
Visual Secret Sharing between Remote Participants
Visual cryptography and random grids are forms of visual secret sharing that encrypt a secret image into indecipherable shares. Decryption occurs by printing them onto transparencies and stacking, but this requires participants to be in the physical presence of each other, so this paper addresses the use of visual secret sharing between remote, incommunicado agents. To this end, a prototype app...
متن کاملSecret Sharing
This document provides the basic concept of Secret Sharing technique in practice. Main overview of some current secret sharing schemes are discussed according to the papers, provided during the course. Future scope and possibilities of secret sharing schemes are also introduced.
متن کاملOn Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is m times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only...
متن کاملSecret Sharing and Shared Information
Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, the...
متن کاملHypergraph Decomposition and Secret Sharing
In this paper we investigate the construction of efficient secret sharing schemes by using a technique called hypergraph decomposition, extending in a non-trivial way the previously studied graph decomposition technique. A major advantage advantage of hypergraph decomposition is that it applies to any access structure, rather than only structures representable as graphs. As a consequence we obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Engineering
سال: 2014
ISSN: 2314-8063
DOI: 10.1155/2014/736750